Solving Optimization Problems of Metamaterial and Double T-Shape Antennas Using Advanced Meta-Heuristics Algorithms
نویسندگان
چکیده
This study offers an adaptive dynamic sine cosine fitness grey wolf optimizer (ADSCFGWO) for optimizing the parameters of two types antennas. The antennas are metamaterial and double T-shape monopoles. ADSCFGWO algorithm is based on technique recently developed powerful optimization techniques: a modified (GWO) value (SCA). suggested approach utilizes capabilities both algorithms to balance better exploration exploitation responsibilities process while achieving rapid convergence. First, new feature selection proposed choose most significant features from dataset using ADSCFGWO-based ensemble model optimal performance. also optimizes bidirectional recurrent neural network (BRNN) estimate monopole antenna characteristics. Several experiments were undertaken demonstrate superiority by comparing their results those existing algorithms, selectors, regression models. In addition, statistical analysis offered evaluate algorithm’s effectiveness stability. achieved findings efficacy method over numerous competing algorithms.
منابع مشابه
Design and Analysis of Meta-heuristics for Constrained Optimization Problems
This goal of this senior design project is to implement and analyze the effectiveness of different meta-heuristic algorithms on solving two constrained optimization problems: the Bin Packing Problem and the Generalized Assignment Problem. Specifically, we are most interested in applying a certain meta-heuristic technique, the Genetic Algorithm. Although genetic algorithms have been used to solv...
متن کاملSolving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms
Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy development, transportation problems, and others. In the context of a bilevel single objective problem, there exists a nu...
متن کاملA Testbed for Solving Optimization Problems Using Cultural Algorithms
This paper introduce a cultural algorithm based testbed which allows one to plug and play various combinations of evolution components for solving constrained numerical optimization. Our cultural algorithm framework combines weak search method with knowledge representation scheme for collecting and reasoning knowledge about individual experience. Currently genetic algorithm based software packa...
متن کاملSolving Optimization Problems in Wireless Networks Using Genetic Algorithms
Sajal K. Das Nilanjan Banerjee Abhishek Roy 15.
متن کاملHybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems
In this paper we have presented a combination of two metaheuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3190508